An origin-based model for unique shortest path routing

A Novel Mathematical Model for the Unique Shortest Path Routing Problem

Link weights are the principal parameters of shortest path routing protocols, the most commonly used protocols for IP networks. The problem of optimally setting link weights for unique shortest path routing is addressed. Due to the complexity of the constraints involved, there exist challenges to formulate the problem properly, so that a solution algorithm may be developed which could prove to ...

An Optimal Routing Strategy Based on Specifying Shortest Path

Unlike the shortest path is randomly chosen in the traditional shortest path routing strategy, a novel routing strategy to improve the network transportation capacity is proposed in this paper. According to the different characteristics of the nodes along actual paths, we specify the shortest paths of all pairs of nodes aiming at reducing the betweenness of those high-betweenness nodes. Simulat...

Trust and Shortest Path Selection based Routing Protocol for MANET

Mobile Ad hoc Network (MANET) comprises a Collection of wireless nodes that does not rely on any fixed infrastructure or base station. Trust based routing in MANET is challenging task due to its on demand dynamic nature which makes it susceptible to various types of attacks such as black holes, Byzantine, rushing attacks etc. The proposed trust based Management framework gives an overview about...

Multi Constraint Shortest Path Routing

Lower Bounds for Shortest Path Interval Routing

Interval Routing was introduced to reduce the size of the routing tables: a router nds the direction to forward a message by determining the interval that contains the destination address of the message, each interval being associated to one particular direction. In this paper, we give lower bounds for the minimum number of intervals per edge needed to achieve shortest path routings for the cla...